Iterative image search algorithm informed by continuous human-machine input feedback

ABSTRACT

System and computer-implemented image search engine of analyzing tags associated with a sequence of images presented to a user to present a current object of interest of the user is disclosed. An image from among a plurality of images is presented on an electronic display. The image is associated with a set of tags. An input is received indicating a user&#39;s preference for the image. A plurality of tags is processed based on the preference and the set of tags to determine a next set of tags from the plurality of tags. A next image is determined from the plurality of images based on the next set of tags. The next image represents a physical object, different from a physical object represented by the previous image. A sequence of images is generated by repeating the above process with the next image in place of the previous image for present a user&#39;s current object of interest.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. Non-Provisional applicationSer. No. 17/122,641, filed Dec. 15, 2020, which is a continuation ofU.S. Non-Provisional application Ser. No. 16/363,693, filed Mar. 25,2019, now U.S. Pat. No. 10,885,101, issued Jan. 5, 2021, which is acontinuation of U.S. Non-Provisional application Ser. No. 15/054,979,filed Feb. 26, 2016, now U.S. Pat. No. 10,268,702, issued Apr. 23, 2019,which is a continuation-in-part of U.S. Non-Provisional application Ser.No. 14/827,205, filed Aug. 14, 2015, now U.S. Pat. No. 9,323,786, issuedApr. 26, 2016, which claims priority to and the benefit of U.S.Provisional Application No. 62/037,788, filed Aug. 15, 2014, each ofwhich is hereby incorporated by reference herein in its entirety.

FIELD OF THE PRESENT DISCLOSURE

Aspects of the present disclosure relate generally to systems andmethods of analyzing tags associated with a sequence of images presentedto a user to guide a user to a current object or item of interest.

BACKGROUND

Conventional image search engines rely exclusively upon the user toinput into the search engine words or an image describing or depictingwhat the user is searching for. The results are therefore only as goodas the input. Moreover, conventional image search engines put before theuser a large number of images, which the user must then sift through tosee if an image describing or depicting what the user was searching foris in the search results. This type of searching relies exclusively uponthe human user to enter words or upload an image that already describesor depicts what the user is searching for. The search results then shiftthe burden to the user to sift through the results, often hundreds oreven thousands of images, to see whether a relevant hit has beenlocated. If the search results are not relevant, which the user oftendiscovers after looking through a page or more of image thumbnails, thenthe user must re-enter a new search, perhaps with different words or adifferent starting image, and the previously downloaded images aredisregarded but often remain in memory. This is an extremely inefficientway to search for and locate an image that depicts an item of interestto the user. This search consumes extensive network bandwidth bydownloading to the user's device many images, requires extensivetemporary memory to store the images, and consumes extensive processingresources particularly if the user needs to input multiple search termsto find an image of interest. For users who are not precisely certainwhat they are searching for or how to articulate precisely how toidentify what they are looking for, or who do not input amachine-optimal combination of words or terminology, the search resultsoften will not produce meaningful results. Persistent users will tryagain and maybe again, usually after sifting through hundreds orthousands of hits, but this comes at the expense of network, memory, andcomputing resources not to mention frustration to the user.

Moreover, conventional image search algorithms do not have a mechanismfor “surprising” the user with an image that might be of interest tothem but are not within the parameters of the originally inputted searchparameters. Surprising images can be returned, but only due tolinguistic homonyms or other similarities in the inputted searchparameter with the image attributes located by the search engine. Someusers do not know precisely what they are looking for until it ispresented to their eyes, at which time they realize this imagerepresents something of interest to them. One way to do this would be toserve up randomly selected images, but this would be pure guesswork,resulting in outlandish or bizarre outliers that have no thoughtfulrelationship or logical relevance to a current interest of a user.Inspiration can be visual and arrives only when the user's senses aretriggered by something familiar. Conventional search engines do notallow such perspectives to emerge. In other words, conventional enginesask the user to tell the machine what the user is looking for, and themachine dutifully reports images that represent what the machinebelieves to be similar based on the precise search parameters inputtedby the user. There is no search engine that allows the user to beginfrom an uncertain or ill-defined starting point and then guides thatuser through a journey of discovery that arrives at what the user isactually interested in by soliciting continuous feedback from the humanuser and thereby facilitating mutual interaction among the human and themachine.

In addition, there exist a multitude of software applications thatattempt to make recommendations for users based on analyzing a user'shistory. A user's history can include or reflect, for example, choicesthe user previously made based on the user's preferences. Although auser's preferences can be constant as a whole over a long period oftime, the generality of the preferences allow for a user's currentspecific preference or interest to be less defined. For example, auser's current preferences can be more granular or initially ill-definedcompared to what can be captured by electronic recommendation systemsthat rely on analyzing a user's history to make a current recommendationat a specific moment in time when the user may be desiring something inparticular. Thus, the granularity, subjectivity, or arbitrariness of auser's current, specific preference also allows for specific currentobjects or items of interest that cannot accurately be predicted basedon a user's history alone. Therefore, current software applications orsearch engines do not help a user determine what the user's currentobject or item of interest is despite having access to the user'shistory. Moreover, although the user may know that he or she wantssomething, the particular object of the user's interest may be unknowneven to the user until one of the user's senses is inspired or provoked.Further, thinking by the user of what the users' current object ofinterest is, alone, may not help the user in defining his or her currentobject of interest.

According to aspects of the present disclosure, a system andcomputer-implemented method are disclosed that guide a user to his orher current object of interest based on a sequential presentation ofimages one at a time representative of possible physical objects ofinterest.

SUMMARY

A computer-implemented search algorithm displays one image at a time toa user and continuously receives from the user feedback on the displayedimage to inform the next image to be displayed to arrive very quickly ata result that represents something the user is searching for. Thisresult could be something (an object or item, for example) that the userwants or likes, or is interested in, or has a preference for, ordesires, or that otherwise engenders positive or favorable affections oremotions in the user. In short, it answers the question posed by theuser, what am I looking for right now? The user may not even know theanswer to this question when the search is started, but the algorithmselects a starting image from the user's expressed preferences, and theniterates by displaying one image at a time in response to feedback fromthe user for each image as to whether the user liked or did not like thecontent of the image. A key to the invention is how the algorithmprocesses tags associated with images or groups of images differentlydepending on the user's input regarding a particular image, andoptionally in combination with a specific tag weighting schema describedherein. The content portrayed in each image can be tagged with manydifferent tags that describe the content objectively or characterize thecontent in some subjective manner, such as based on an emotive orattitudinal characteristic. While the details of the tag processing aredescribed in more detail below, in essence, a negative indication by theuser about the content portrayed in an image results in a removal by thealgorithm of the particular tag combination associated with thenegatively indicated image. This means that during the search session,no image associated with the exact same tag combination will ever bedisplayed again. In the case of a positively indicated image, thealgorithm retains the combination of tags associated with that image,adds another tag to the retained combination to make a new tagcombination, and searches for the next image having the new tagcombination. The starting or initial set of tags at the start orinitiation of a search session can be based upon the user's expressedpreferences. By processing tags differently based on the user's input,the image search algorithm can operate very quickly to locate the nextimage. Its simplicity saves significant computing, memory, and bandwidthresources yet results in a highly accurate search methodology that veryquickly iterates to an image having content that represents somethingthe user desires or wants at that given instant.

The algorithm displays one image at a time to the user's device. Morethan one image may be downloaded to the user's device, but only one ispresented on the user's display at a time. This means that while theuser's device awaits the user's input, at least two images can bedownloaded to the user's device, one to cover a negative input, and theother to cover a positive input. This image queuing results in nearly noperceivable latency to the user as they conduct the search session,because the next image to be displayed is already either in the processof being downloaded or is already downloaded to the user's device by thetime the user makes a positive or negative indication for the currentimage being displayed. By queuing up images for display one at a time onthe user's device, significant computer network resources are saved andfar less memory space is required on the user's device compared to acommon search that yields many results and returns a host of images.

The image search session stops when the user so indicates, meaning thatthe image currently being displayed has content that the user desires,or after a certain number of images have been displayed or the user hasnegatively responded to a certain number of images. In the latter case,the user can start a new image search session. In the case where thesession has concluded with an image having content desired by the user,the algorithm shows the user a list of locations or a map of locationswhere the image can find the content portrayed on the image. This allowsthe user to satisfy or experience immediately whatever interest, desire,curiosity, or craving strikes that user at that particular moment.

An aspect of the present disclosure includes a computer-implementedmethod that includes determining, by the one or more computer devices, aplurality of tags specific to a user, from among a pool of tags, basedon each tag of the plurality of tags specific to the user beingassociated with a profile of the user. The method further includestransmitting, from the one or more computer devices, one electronicimage, from among a plurality of electronic images stored on the one ormore computer devices, to the electronic device. The one electronicimage represents a physical object and is associated with one set oftags from the plurality of tags specific to the user. Each tag of theone set of tags describes or characterizes attributes of the physicalobject represented by the one electronic image. The method furtherincludes receiving, from the electronic device, an input from the userindicating a preference for the physical object represented by the oneelectronic image. The method also includes processing, by the one ormore computer devices, the plurality of tags specific to the user basedon the preference and the one set of tags to determine a next set oftags from the plurality of tags. The method further includesdetermining, by the one or more computer devices, a next image from theplurality of images associated with the next set of tags. The next imagerepresents a physical object that is different from the physical objectrepresented by the one image, and the next set of tags describes orcharacterizes attributes of the physical object represented by the nextimage. The method also includes generating a sequence of images byrepeating the presenting, the receiving, the processing, and thedetermining with the next image in place of the one image during asession of presenting the current object of interest of the user.

An additional aspects of the present disclosure includes one or morecomputer-readable, non-transitory, storage media encodingmachine-readable instructions that, when executed by one or morecomputers, cause operations to be carried out. The operations includedetermining, by the one or more computer devices, a plurality of tagsspecific to a user, from among a pool of tags, based on each tag of theplurality of tags specific to the user being associated with a profileof the user. The operations further include transmitting, from the oneor more computer devices, one electronic image, from among a pluralityof electronic images stored on the one or more computer devices, to theelectronic device. The one electronic image represents a physical objectand is associated with one set of tags from the plurality of tagsspecific to the user. Each tag of the one set of tags describes orcharacterizes attributes of the physical object represented by the oneelectronic image. The operations further include receiving, from theelectronic device, an input from the user indicating a preference forthe physical object represented by the one electronic image. Theoperations also include processing, by the one or more computer devices,the plurality of tags specific to the user based on the preference andthe one set of tags to determine a next set of tags from the pluralityof tags. The operations further include determining, by the one or morecomputer devices, a next image from the plurality of images associatedwith the next set of tags. The next image represents a physical objectthat is different from the physical object represented by the one image,and the next set of tags describes or characterizes attributes of thephysical object represented by the next image. The operations alsoinclude generating a sequence of images by repeating the presenting, thereceiving, the processing, and the determining with the next image inplace of the one image during a session of presenting the current objectof interest of the user.

Another aspect of the present disclosure includes a computer-implementedmethod that includes receiving, from an electronic device associatedwith a user, an indication of an instance of an application executed onthe electronic device. The application, together with one or morecomputer devices, is configured to direct the user to a current objectof interest. The method further includes determining, by the one or morecomputer devices, a plurality of tags specific to the user, from among apool of tags, based on each tag of the plurality of tags specific to theuser being associated with a profile of the user. The method alsoincludes causing a presentation on a display of the electronic device ofone electronic image, from among a plurality of electronic images storedon the one or more computer devices. The one electronic image representsa physical object and is associated with one set of tags from theplurality of tags specific to the user. Each tag of the one set of tagsdescribes or characterizes attributes of the physical object representedby the one electronic image. The method further includes processing, bythe one or more computer devices, the plurality of tags specific to theuser to determine a first potential set of tags corresponding to apositive preference from the user for the physical object represented bythe one electronic image and a second potential set of tagscorresponding to a negative preference from the user for the physicalobject represented by the one electronic image, prior to receiving aninput from the user indicating a preference for the physical object. Themethod further includes transmitting, from the one or more computerdevices, a first potential electronic image and a second potentialelectronic image, prior to receiving the input from the user indicatingthe preference for the physical object. The first potential electronicimage is associated with the first potential set of tags and the secondpotential electronic image is associated with the second potential setof tags. The method also includes receiving, from the electronic device,the input from the user indicating the preference for the physicalobject represented by the one electronic image. The method furtherincludes causing, by the one or more computer devices, a presentation ofthe first potential electronic image or the second potential electronicimage based on the preference for the physical object represented by theone electronic image being the positive preference or the negativepreference. The method further includes generating a sequence ofelectronic images presented to the user one at a time on the display ofthe electronic device by repeating the processing, the transmitting, thereceiving the input form the user, and the causing of the presentationof the first potential electronic image or the second potentialelectronic image in place of the one electronic image. Generating thesequence directs the user to the current object of interest during asession of the instance of the application executed on the electronicdevice.

Additional aspects of the present disclosure will be apparent to thoseof ordinary skill in the art in view of the detailed description ofvarious embodiments, which is made with reference to the drawings, abrief description of which is provided below.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a functional block diagram of a computer system according toan aspect of the present disclosure.

FIG. 2A is a flowchart of a computer-implemented method or algorithm ofanalyzing tags associated with a sequence of images presented to a userto present a current object or item of interest of the user according toaspects of the present disclosure.

FIG. 2B is a flowchart of a computer-implemented method or algorithm ofdetermining weightings of tags based on tag associations according toaspects of the present disclosure.

FIG. 2C is a flowchart of another computer-implemented method oralgorithm of determining weightings of tags based on tag frequenciesaccording to aspects of the present disclosure.

FIG. 2D is a flowchart of a computer-implemented method or algorithm ofqueuing one or more electronic images to present to a user according toaspects of the present disclosure.

FIG. 2E is a flowchart of a computer-implemented method or algorithm ofdetermining, from among a pool of tags and a pool images, tags andimages that are relevant for a user according to aspects of the presentdisclosure.

FIG. 2F is a flowchart of a computer-implemented method or algorithm ofupdating and/or modifying associations between elements within thesystem according to aspects of the present disclosure.

FIG. 3 is a diagram of a flow illustrating the processing of a pluralityof tags that are relevant to a user according to aspects of the presentdisclosure.

FIG. 4A illustrates a user interface of a computer-implemented method orprocess of analyzing tags associated with a sequence of images presentedto a user to present a current object of interest of the user accordingto aspects of the present disclosure.

FIG. 4B illustrates another user interface of a computer-implementedmethod or process of analyzing tags associated with a sequence of imagespresented to a user to present a current object of interest of the useraccording to aspects of the present disclosure.

FIG. 4C illustrates another user interface of a computer-implementedmethod or process of analyzing tags associated with a sequence of imagespresented to a user to present a current object of interest of the useraccording to aspects of the present disclosure.

FIG. 4D illustrates another user interface of a computer-implementedmethod or process of analyzing tags associated with a sequence of imagespresented to a user to present a current object of interest of the useraccording to aspects of the present disclosure.

FIG. 4E illustrates another user interface of a computer-implementedmethod or process of analyzing tags associated with a sequence of imagespresented to a user to present a current object of interest of the useraccording to aspects of the present disclosure.

FIG. 4F illustrates another user interface of a computer-implementedmethod or process of analyzing tags associated with a sequence of imagespresented to a user to present a current interest of the user accordingto aspects of the present disclosure.

FIG. 4G illustrates another user interface of a computer-implementedmethod or process of analyzing tags associated with a sequence of imagespresented to a user to present a current interest of the user accordingto aspects of the present disclosure.

FIG. 4H illustrates a user interface for uploading an image according toaspects of the present disclosure.

FIG. 4I illustrates another user interface for uploading an imageaccording to aspects of the present disclosure.

FIG. 4J illustrates another user interface for uploading an imageaccording to aspects of the present disclosure.

FIG. 4K illustrates a user interface for visualizing a profile of a useraccording to aspects of the present disclosure.

FIG. 4L illustrates a user interface for visualizing a profile of a useraccording to aspects of the present disclosure.

DETAILED DESCRIPTION

While this disclosure is susceptible of embodiment in many differentforms, there is shown in the drawings and will herein be described indetail example implementations of the inventions and concepts hereinwith the understanding that the present disclosure is to be consideredas an exemplification of the principles of the inventions and conceptsand is not intended to limit the broad aspect of the disclosedimplementations to the examples illustrated. For purposes of the presentdetailed description, the singular includes the plural and vice versa(unless specifically disclaimed); the words “and” and “or” shall be bothconjunctive and disjunctive; the word “all” means “any and all”; theword “any” means “any and all”; and the word “including” means“including without limitation.”

A (software) module can refer to computer-readable object code thatexecutes a software sub-routine or program, which corresponds toinstructions executed by any microprocessor or microprocessing device toperform described functions, acts, or steps. Any of the methods oralgorithms or functions described herein can include non-transitorymachine or computer-readable instructions for execution by: (a) anelectronic processor, (b) an electronic controller, and/or (c) any othersuitable electronic processing device. Any algorithm, software module,software component, software program, routine, sub-routine, or softwareapplication, or method disclosed herein can be embodied as a computerprogram product having one or more non-transitory tangible medium ormedia, such as, for example, a flash memory, a CD-ROM, a floppy disk, ahard drive, a digital versatile disk (DVD), or other electronic memorydevices, but persons of ordinary skill in the art will readilyappreciate that the entire algorithm and/or parts thereof couldalternatively be executed by a device other than an electroniccontroller and/or embodied in firmware or dedicated hardware in awell-known manner (e.g., it may be implemented by an applicationspecific integrated circuit (ASIC), a programmable logic device (PLD), afield programmable logic device (FPLD), discrete logic, etc.).

As discussed above, there currently exist recommendation systems thatare unable to account for a user's current (i.e., contemporaneous)interest or preference based on the breadth of the user's interest,despite, for example, the recommendation systems having access toinformation regarding the user's history. The granularity of a user'scurrent preference relative to, for example, a user's historicalpreferences with respect to the subject matter relating to thepreference prohibits current recommendation systems from being able toestimate or present the user's current object or item of interest at themoment in time the user may be craving something. The terms object anditem herein are interchangeable. At best, current recommendation systemsmerely provide a one-time guess regarding the user's current preference.Moreover, current applications exist that provide information regardingbroad categories of physical or tangible objects that are availablewithin the user's current location. However, the amount of informationprovided by such applications may amount to information overload. Theinformation overload does not allow a user to determine a specificphysical object in which the user is currently interested. What isneeded, inter alia, is a guided, iterative searching solution thatrepeatedly and dynamically adjusts searching criteria in response tohuman-machine inputs made by the user to arrive at a recommendation thatwill satisfy the user's contemporaneous craving at the conclusion of thesearch session. In this way, both human and machine are necessarypartners in this search strategy. Only the human can, using his or hersubjective senses, ascertain from an image how a user fees about what ispresented in the image. However, to satisfy an immediate craving, themachine is needed to help the human user arrive at a recommendationquickly, within less than a minute or so. The Internet, cellular dataand wireless technology, and smartphones have given users instant accessand visibility to a myriad of options, but in some respects, this accessand visibility is as much a blessing as it is a curse. With so manychoices and options readily available, a new programmed machine isneeded to help users find relevant information quickly to satisfy needsthat are fleeting and must be satisfied quickly.

Accordingly, aspects of the present disclosure provide for systems andmethods of analyzing tags associated with a sequence of images presentedto a user one at a time to guide a user to a current object of interest(in the form of an electronic photograph displayed on the user'selectronic device). Each electronic image (e.g., electronic photograph)represents a physical object that the user can obtain or experiencethrough or at a physical source that provides the physical object or anexperience depicted in the electronic image. Each electronic imagewithin the sequence is associated with a set of tags that describe orcharacterize the physical object or attributes of or associated with thephysical object. Based on a user's preference (e.g., positive ornegative or a continuum in between) for each image, a new electronicimage is presented to generate the sequence of images. The new image isselected based on the set of tags associated with the image thatdescribe the physical object represented by the image, and how the setof tags for the new image relate to the set of tags for the previousimage based on the preference of the previous image. The sequence ofpresenting images to the user that represent physical objects continuesto guide the user into determining a physical object that satisfies ordescribes or is relevant to the user's current object of interest. Oncethe user is presented with an image that represents a physical(tangible) object or experience that the user is currently interested in(e.g., craving), the systems and methods allow for the user to selectthe image (e.g., a digital photograph) and obtain information on how toobtain the corresponding physical object of interest or to experiencewhat is depicted in the selected image.

FIG. 1 is a functional block diagram of a system 100 according to anaspect of the present disclosure. First, the general components of thesystem 100 will be introduced, followed by examples. The system 100includes one or more electronic computers (clients) 102 a, 102 b.Reference numbers used herein without a letter can refer to a specificone of the plurality of items, a subset of multiple items of theplurality of items, or all items of the plurality of items so numberedwith the same reference number. Thus, by way of example, the referencenumber 102 can refer to the computer 102 a, the computer 102 b, or bothof the computers 102 a and 102 b, as shown in FIG. 1 . The one or morecomputers 102 a, 102 b connect to a communication network 104, such asthe Internet. However, the communication network 104 can be any type ofelectronic communication network. A computer as used herein includes anyone or more electronic devices having a central processing unit (CPU) orcontroller or microprocessor or microcontroller as understood by thoseskilled in the art of electronic computers. Examples of computersinclude tablet computers, laptop computers, desktop computers, servers,smartphones, a wearable electronic device such as a watch, an eyeglass,an article of clothing, or a wristband, and personal digital assistants(PDAs). The term computer as used herein can include a system ofelectronic devices coupled together to form what is conventionallyreferred to as a computer. For example, one or more electronic inputdevices, such as a keyboard or a mouse, and one or more electronicdisplay devices, such as an electronic video display, can be coupled toa housing that houses the CPU or controller. Or, all components of thecomputer can be integrated into a single housing, such as in the case ofa tablet computer or a smartphone. The one or more computers 102 a, 102b conventionally include or are operatively coupled to one or moreelectronic memory or storage devices that store digital informationtherein, including non-transitory machine-readable instructions andelectronic data.

The one or more computers 102 a, 102 b include electronic user interfacedevices 110 a, 110 b. Each user interface device 110 a, 110 bcorresponds to a human-machine interface (HMI) that accepts inputs madeby a human (e.g., via touch, click, gesture, voice, etc.) and convertsthose inputs into corresponding electronic signals. Non-limitingexamples of user interface devices 110 a, 110 b include a touchscreen, akeyboard, an electronic mouse device, an electronic camera or otherimaging device, and a microphone. These are also referred to ashuman-machine interface devices, because they allow a human to interactwith a machine by providing inputs supplied by the human user to themachine.

The one or more computers 102 a, 102 b also include electronic displaydevices 112 a, 112 b that are configured to display information that canbe visually perceived. Non-limiting examples of display devices 112 a,112 b include an electronic video display, a stereoscopic display, orany electronic display configured to visually portray informationincluding text, static graphics, and moving animations that isperceivable by the human eye. The electronic display devices 112 a, 112b display visual information contained in an electronic user interface(UI). The electronic UI can also include selectable elements that areselectable using the one or more HMI devices 110 a, 110 b. Thus, theelectronic UI generally can include a graphical user interface (GUI)component and a human-machine user interface component, via which ahuman user can select selectable elements displayed on the GUI via theHMI interface.

The one or more computers 102 a, 102 b also include softwareapplications 114 a, 114 b. That is, the one or more computers 102 a, 102b execute non-transitory machine-readable instructions and data thatimplement the software applications 114 a, 114 b. The applications 114a, 114 b perform one or more functions on the one or more computers 102a, 102 b. The applications 114 a, 114 b can be various specific types ofapplications, such as a web browser application or a native application.Within the system 100, the applications 114 a, 114 b convey informationbetween the one or more computers 102 a, 102 b and the communicationcomputer network 104 (e.g., Internet) via a conventional wired orwireless electronic communications interface associated with the one ormore computers 102 a, 102 b. Alternatively, or in addition, theapplications 114 a, 114 b can be a native application. Nativeapplications convey information between the one or more computers 102 a,102 b over the communication network 104 to an application server 106.The native applications 114 a, 114 b conventionally convey informationbetween the one or more computers 102 a, 102 b over the communicationnetwork 104 via a conventional wired or wireless electroniccommunications interface associated with the one or more computers 102a, 102 b.

As described above, the server 106 is also coupled to the communicationnetwork 104. The server 106 is a type of computer, and has a wellunderstood meaning in the art. The server 106 can be, for example, a webbrowser server, such as in the case of applications 114 a, 114 b beingweb browser applications. Or, the server 106 can be, for example, anative application server, such as in the case of applications 114 a,114 b being native applications.

An electronic database 108 is incorporated in or is coupled to theserver 106. The database 108 is a form of a memory device or a datastore, and stores electronic data for retrieval and archival relative tothe server 106. Both the server 106 and the one or more applications 114a, 114 b communicate information according to one or more protocols,such as the hypertext transfer protocol (HTTP) in the case of thecommunication network 104 being the Internet. In the case of thecommunication network 104 being a private local area network (LAN),instead of the Internet, any other communications protocol can be usedinstead of the HTTP. For example, native applications can insteadcommunicate using a proprietary or conventional communications protocolto pass information between the one or more computers 102 a, 102 b andthe server 106.

Although the system 100 is shown generally with respect to FIG. 1 asincluding two computers 102 a, 102 b, one server 106, and one database108, the system 100 can include any number of computers 102 a, 102 b,any number of independent or clustered servers 106 (e.g., server farm orsever cluster), and any number of databases 108. Moreover, some or allfunctionality of one or more components of the system 100 can betransferred, in whole or in part, to other components of the system 100.By way of example, functionality of the server 106 and/or the database108 can be transferred, in whole or in part, to the one or morecomputers 102 a, 102 b, depending on the functionality and performanceof the computers 102 a, 102 b.

The applications 114 a, 114 b communicate with the server 106 and thedatabase 108 over the communication network 104 for analyzing tagsassociated with a sequence of images presented to a user to guide a userto a current object or experience of interest. The applications 114 a,114 b control the user interface devices 110 a, 110 b and the displaydevices 112 a, 112 b to present (e.g., display) the electronic images tothe user and to receive inputs from the user indicating the user'spreferences for the images. The images are communicated over thecommunication network 104 to the applications 114 a, 114 b of the one ormore computers 102 a, 102 b from the database 108, either directly orthrough the server 106. Accordingly, based on a client-serverarrangement of the system 100, with the computers 102 a, 102 b as theclients and the server 106 as the server, the database 108 stores theinformation used for analyzing tags associated with a sequence of imagespresented to a user to guide a user to a current object of interest. Theserver 106 performs the functionality of the algorithms describedherein, including serving the information from the database 108 to theclients (e.g., computers 102 a, 102 b). The computers 102 a, 102 bpresent the information to the user and receive the inputs from theusers, which are then presented to the server 106 for processing.However, the functionality disclosed herein with respect to thedisclosed algorithms can be divided among the components of the system100 differently than as explicitly disclosed, without departing from thepresent disclosure. For example, all of the functionality disclosedherein can be embodied in one or more of the computers 102 a, 102 b,such as the computers 102 a, 102 b being arranged as a distributednetwork, depending on the capability of the computers 102 a, 102 b.

As one facet of the information, the database 108 electronically storesthe electronic images within a data store of images. The images can beof various file formats and image types. By way of example, the fileformats can include JPEG, Tagged Image File Format (TIFF), PortableNetwork Graphics (PNG), etc. The image types can include digitalphotographs, digital drawings, icons, etc. As discussed above, theimages stored on the database 108 represent a physical object that maybe of interest to the user (e.g., the user may be craving). Accordingly,the images visually convey information to the user so that the userunderstands the physical objects that the images represent. The system100 can initially include a set number of images. The set number of theimages can be defined by the administrator of the system 100. Asdescribed below, the system 100 also allows for users to add additionalimages to the system 100. For example, users can upload images from theone or more computers 102 a, 102 b to add additional images to thedatabase 108. As the users interact with the system 100, and the usersupload images to the system 100, the number of images increases.

For each image, the database 108 stores information regarding thephysical object that the image represents. The physical object or itemcan be any physical (tangible) object or item that is representable byan image or can depict an experience such that a user can identify orperceive the physical object or experience when presented the image.

The database 108 also stores electronic tags. Primary tags are usedwithin the system 100 to describe and/or characterize the physicalobject that is represented by an image. The primary tags can includesingle words or several words linked together as a tag that describe orcharacterize the physical object overall, or that describe orcharacterize sub-components or sub-aspects (e.g., attributes) of thephysical object. Accordingly, for each image, the image is associatedwith a set of tags that describe or characterize the physical object.The database 108 stores all of the tags within a pool of tags, which isthe totality of tags that can be associated with an image to describe acharacteristic and/or a quality of the physical object that isrepresented by the image. The primary tags can be any type of descriptorof the physical object represented by the image. In some aspects, theprimary tags can describe subcomponents of the physical objects. Thetags can also identify or describe the specific physical object, item,or experience.

The tags can be objective, subjective (or semi-subjective), ortangential regarding how the tags describe or characterize the physicalobject that is associated with the image. The examples of primary tagsprovided above are objective tags that directly describe the physicalobjects. The tags may additionally include tags that are at leastpartially subjective and/or tangentially describe the physical objects.With respect to physical objects for purposes of example, subjective orsemi-subjective tags may apply to the physical object for one user butnot necessarily all users. Tangential tags may describe aspects of thephysical object only when correlated with other information. Such otherinformation may only be known or apply to a subset of users thatinteract with the system 100. By way of example, such tags may be termscurrently trending in social media, such as hashtags on TWITTER® thatapply to only a subgroup of users that are following the current socialmedia trends. Such tags include, for example, hipster, yolo, GenY, GenX,etc. Independent of the context of the tag, these tangential tags do notnecessarily apply to a physical object. However, patterns may developthat allow certain tangential tags to be understood as referring to aquality or characteristic of a physical object.

Like the images, the system 100 initially begins with a certain numberof tags. However, the group of tags can be dynamic and evolve as theusers interact with the system 100. For example, additional tags can beadded to the pool of tags as users upload new images of physical objectsto the system 100 and describe the physical objects based on new tagsthat the users create. The users can create additional tags to describeor characterize the physical object that is associated with the imagethat the users uploaded. Each image is associated with one or more ofthe tags from among the group of tags as a set of tags for the image.The association can be based on an administrator of the system 100associating the tags with the images. Alternatively, or in addition, theassociation can be based on users of the system 100 associating the tagswith the images and/or creating new tags. The association based on theusers can be manual, such as the users manually selecting a tag toassociate with an image. Alternatively, or in addition, the associationcan be automatic, such as the system 100 automatically determining tagsthat apply to images. Based on the images being associated with multipletags as a set of tags, the database 108 also stores informationpertaining to specific sets of tags. A specific combination of tags is aset of tags. A single set of tags can describe multiple different imagesbased on the generality of each tag and an image being associated withany number of tags. The database 108 may include a data structure, suchas a table, to track the various sets of tags based on the variousassociations between tags and images within the database 108.

The database 108 also stores and tracks associations between elements ofthe system 100, such as between tags, between sets of tags, betweenimages and tags and/or sets of tags, between users and the elements,etc. The system 100 can associate a tag with an image based on the imagealready being associated with another tag, and both of the tagsincluding an association. By way of example with respect to physicalobjects, an image may represent a an object A that includes a componentB. The image may already be associated with the tag A but not beassociated with the tag B. Based on an association developed by thesystem 100 tracking usage of the tag A with the tag B, in addition to,for example, other users liking other images that are tagged with bothtags A and B, the system 100 can automatically determine to associatethe tag B with the image based on the image being associated with thetag A. The associations can develop as the number of images thatrepresent different physical objects increases within the database 108,or as more users interact with the tags and with the images. Forexample, as more users upload images to the system 100, the users mayassociate both of the tags A and B to the newly uploaded images. Thesystem 100 tracks the continued association of the tag A with the tag Band logs the association within the database 108.

The tags may be divided into two overall categories, such as primarytags and secondary tags. Primary tags are defined by an administrator ofthe system 100. The primary tags include tags that directly describe orcharacterize the physical object. The system 100 at least initiallyincludes primary tags. The system 100 can also initially includesecondary tags. The secondary tags are defined by the administrator ofthe system 100 and/or by users of the system 100. The secondary tags mayidentify the same characteristic and/or quality as the primary tags, orthe secondary tags may identify different characteristics and/orqualities as the primary tags. Secondary tags may directly describe orcharacterize the physical object, such as with primary tags. Inaddition, secondary tags may subjectively describe or characterize thephysical objects, or may tangentially describe or characterize thephysical objects as described above.

Each image is associated with at least one primary tag, but can beassociated with any number of primary tags and secondary tags. Someimages may be associated with only one primary tag. Some images may beassociated with many different tags.

The systems and methods of analyzing tags associated with a sequence ofimages presented one at a time to a user to guide a user to a currentobject of interest relies on a plurality of tags that is associated witha user being processed based on a previous set of tags of an image and apreference for that image from the user. Accordingly, the database 108may store, or the server 106 may dynamically generate, a plurality oftags that are a subset of all of the tags (e.g., pool of tags) that arestored on the database 108. The plurality of tags includes not only thetags but also the sets of tags that correspond to the images that arecovered by one or more of the tags. As will be described in greaterdetail below, the plurality of tags may be tags that apply or arerelevant to a user, such as tags within the pool of tags that match tagsassociated with a user's profile. As the user is presented with imagesand provides preferences in response to the images, the plurality oftags evolves as certain tags are removed (or not considered) and/orcertain sets of tags are removed (or not considered) from the pluralityof tags.

The database 108 also stores user profiles. Generally, the user profilesinclude information that is used for interacting with the system 100.Such information can include certain tags indicated by the user toinclude with the user's profile, images, physical objects, and/orentities for which the user has indicated a positive or a negativepreference, independent of or dependent of the user interacting withimages presented to the user during a session of analyzing tagsassociated with a sequence of images presented to a user to guide a userto a current object of interest. The information can include tags andimages that apply to certain physical objects that the user prefers(e.g., likes), and certain physical objects that the user does notprefer (e.g., dislikes). The user can indicate such preferences througha manual selection of the tags. Alternatively, or in addition, suchpreferences can be learned by the system 100 during the user'sinteraction with the system 100 over a period of time, such as throughan implicit selection of the tags as preferred tags through the userindicating over time a preference for the tags. The preference can beindicated according to a YES/NO schema, such as the user does or doesnot like a tag, an image, and/or a physical object. Alternatively, thepreference can be indicated according to a weighted schema, such as adegree to which the user does or does not like a tag, image, and/orphysical object. The profile information can include any otheradditional information associated with a user, such as the user's name,address, gender, age, ethnicity, religion, etc. The system 100 trackssuch additional information to mine trends across the users for tags,images, and/or physical objects. For example, the system 100 tracksuser's interactions within the system 100 to develop a user history. Theuser history tracks interactions between the user and the system 100 andallows the user to review the previous interactions. By way of example,the user history can include information pertaining to the user'spreference to specific images that were previously presented to theuser.

According to some embodiments, the user profiles can include objects toavoid or that the user expressly dislikes. The database 108 canautomatically translate the entered negative indications into negativepreferences for certain tags, images, and/or physical objects to whichthe negative indications apply so that images depicting any negativelyindicated objects are not presented to the user. As discussed above, thephysical objects represent objects that are provided by various sources.The database 108 includes information with respect to the location ofthe sources associated with the physical objects and/or the images thatrepresent the sources. By way of example, the database 108 includesinformation with respect to the location that provides the physicalobject or experience. In addition to the location, the database 108 canalso include source profiles. The source profiles allow users to browsethe sources of the objects and click on a suggested or profiled source,leading the user to the source's profile. As part of the above-describedassociations, the system 100 collects and shares visitor frequency withsources when users are redirected to the entities' websites followingselection of images associated with physical objects that are associatedwith the entities.

FIG. 2A is a flowchart of a computer-implemented method or algorithm 200a of analyzing tags associated with a sequence of images presented to auser to guide a user to a current object of interest, using aspects ofthe present disclosure including the one or more computers 102 a, 102 b,the server 106, and the database 108. The computer-implemented method oralgorithm 200 a may be executed within a computer 102 a, the server 106,the database 108, or across multiple platforms, such as on the computer102 a and the server 106. In regard of the latter arrangement, anapplication 114 a executed by the computer 102 a (e.g., client-sideapplication) may perform the computer-implemented method or algorithm200 a in conjunction with an application executed on the server 106(e.g., server-side application) according to a client-serverrelationship. The computer-implemented method or algorithm 200 a beginswith a user initiating a session of the computer-implemented method oralgorithm 200 a. As will be described in greater detail below, thesession of the computer-implemented method or algorithm 200 a beginswith determining a plurality of tags that are associated with the userand that will be processed to determine subsequent images to present tothe user to generate a sequence of images during a session of thecomputer-implemented method or algorithm 200 a. The plurality of tagsalso determines the plurality of images from which the images that arepresented to the user are selected. Thus, according to some embodiments,the computer-implemented method or algorithm 200 a processes onlysubsets of the tags and the images stored in the database 108 based onthe user that initiated the session of the computer-implemented methodor algorithm 200 a.

The computer-implemented method or algorithm 200 a begins withpresenting one of the images, from among the plurality of images, to theuser, such as through the display device 112 a of the computer 102 a(202). As described above, the image represents a physical object and isassociated with a set of tags. Each of tag of the set of tags describesthe physical object that is represented by the presented image. Thus,the user is presented with an image, and the user is able to recognizethe physical object represented by the image.

As will be also described below, along with the image, one or more userinterface elements or objects can be optionally presented on the displaydevice 112 a of the computer 102 a to allow the user to indicate apreference or inclination/disinclination for the physical object that isrepresented by the image. The user interface elements may vary dependingon the functionality/capability of the computer 102 a, the userinterface device 110 a, and/or the display device 112 a. Alternatively,the display device 112 a may not present graphical user interfaceelements (although it could) specifically for the user indicating thepreference for the physical object. Rather or additionally, for example,it may be implicit what action the user should take to indicate thepreference, such as by swiping left on or near the image or anywhere onthe display device 112 a to indicate a negative preference (e.g.,dislike) and swiping right on or near the image or anywhere on thedisplay device 112 a to indicate a positive preference (e.g., like), orvice versa. To be clear, the present disclosure also contemplatesdisplaying graphical UI elements (e.g., like and dislike virtual buttonsdisplayed on the display device 112 for selection using a user interfacedevice 110), and recognizing gestures (e.g., swiping) made by a userrelative to a user interface device 110, or one or the other.

Upon the image being presented (e.g., displayed on the display device112) to the user, the computer-implemented method or algorithm 200 areceives an input from the user indicating a preference for the physicalobject represented by the image (204). The preference may be like or aninclination toward the object (e.g., positive) or dislike ordisinclination against the object (e.g., negative). Alternatively, thepreference may be like (e.g., positive), dislike (e.g., negative), orneither like nor dislike (e.g., neutral). A neutral preference mayindicate that the user cannot tell whether he or she likes or dislikesthe physical object represented by the image. Alternatively, thepreference may be scaled, such as a range of 1 to 10 to indicate thedegree that the user likes (e.g., 6 to 10) or dislikes (e.g., 1 to 5)the physical object represented by the image.

The computer-implemented method or algorithm 200 a then processes theplurality of tags based on the preference indicated by the user (206).Processing of tags refers to the manipulation or treatment of the tagsdrawn from the pool of tags by the computer or server 102, 106 during asession. The plurality of tags that is processed is the tags that areselected from the pool of tags stored within the database 108. Theprocessing includes determining a next set of tags based on thepreference the user provided in response to the previous image, and theset of tags that are associated with the previous image. The preferencedetermines how the set of tags from the previous image is processed todetermine the next set of tags. By way of example, if the preferencethat the user indicated in response to a previous image is positive,negative, or neutral, the plurality of tags is processed (e.g., treated)differently based on the set of tags of the previous image. In responseto the preference for the physical object represented by the previousimage being negative, the processing of the plurality of tags includesremoving tags from the plurality of tags that correspond to the tagsfrom the set of tags of the previous image. The tags are removed fromthe plurality of tags that are processed to determine the next set oftags, for each iteration of the computer-implemented method or algorithm200 a, and the remainder of the session, so that an image is notpresented to the user for the remainder of the session that includes theparticular tags.

Although the tags are described throughout as being removed from theplurality of tags, removal includes removing the tags from the pluralityof tags and also includes leaving the tags within the plurality of tagsbut not considering the tags. For example, the tags can remain withinthe plurality of tags but the tags can be marked as, for example,removed such that the tags are not considered during the processing ofthe plurality of tags.

As discussed above, the tags can be categorized generally as primarytags and secondary tags. An image can be associated with both primarytags and secondary tags. According to some embodiments, the tags thatare associated with an image and that are removed from the plurality oftags in response to a negative preference are only the primary tags fromthe set of tags associated with the image that received a negativepreference. Alternatively, both the primary tags and the secondary tagsfrom the set of tags associated with an image that received a negativepreference are removed from the plurality of tags in response to anegative preference. Alternatively, whether only primary tags or bothprimary tags and secondary tags are removed from the plurality of tagsmay be determined based on the number of images that have been presentedto the user. For example, if the image is one of the first N imagespresented to the user, where N is 3, 4, or 5, only the primary tagsassociated with the image are removed from the plurality of tags inresponse to an input by the user indicating a negative preference.However, if the image is a later image presented to the user, such asthe sixth, seventh, or eighth image, both the primary tags and thesecondary tags that are associated with the image are removed from theplurality of tags. For subsequent images that are presented to a userafter the user has indicated a positive preference to at least oneprevious image, only those tags that are associated with the newlypresented image and that are new relative to the previously presentedset of tags are the tags that are removed from the plurality of tags,whether they are only primary tags or both primary and secondary tags.

In addition to removing tags (e.g., negative tags) that are associatedwith an image that the user provides a negative preference for, thecomputer-implemented method or algorithm 200 a may also remove tags thatare associated with the negative tags from the plurality of tags (e.g.,associated tags). As discussed above, in addition to the tags beingstored in the database 108, the database also stores associationsbetween tags. For example, certain tags may be associated with othertags based on trends in the physical objects represented by the images.Accordingly, in response to a negative preference, thecomputer-implemented method or algorithm 200 a may determine associatedtags that satisfy a threshold association with the negative tags. Thethreshold for the association may be based on any number of factors ormetrics, such as the number of times two tags are associated with thesame image, the number of times or frequency of a user indicating acertain preference (e.g., like or dislike) for an image, and the tagsthat are associated with the image, etc. For example, the associationmay be based on the number of times two tags are associated with animage when the image is indicated by a user as having a positivepreference or a negative preference. However, the threshold fordetermining the association may vary without departing from the spiritand scope of the present disclosure.

In response to the preference for the physical object represented by theimage being positive or favorable, the processing of the plurality oftags includes determining additional tags to add to the tags from theset of tags associated with the image. The additional tags furthernarrow down the current object of interest of the user by building uponthe tags associated with the previous image, for which the user provideda positive preference.

The additional tags may be determined according to various methods. Insome aspects, the additional tags are determined randomly. Both thenumber of tags and the tags themselves can be determined randomly andsubsequently added to the previous set of tags. In some aspects,weightings and/or associations between the tags are determined and usedto determine the one or more additional tags to add to the previous setof tags. As further described below with respect to FIGS. 2B and 2C, theweightings and/or associations may be based on various factors, whichmay apply to all users of the system 100 or apply only to the specificuser.

In some aspects, associations are determined between tags within theplurality of tags for a particular user. In the alternative,associations are determined between tags within the entire pool of tags.The associations can be based on, for example, the number of times twotags apply to the same image within the pool of images. This type ofassociation may be considered a first-degree association. Theassociations can be based on, for example, the number of times three ormore tags apply to the same image within the pool of images. Thus, ingeneral, the associations are determined between the tags based onmultiple tags applying to the same image, and the computer-implementedmethod or algorithm 200 a applies the associations, in part, indetermining a current object of interest of a user by determining one ormore additional tags to add to the previous set of tags, where the oneor more additional tags are associated with the previous set of tags.Similar to above, the threshold for the association may be based on anynumber of factors or metrics, such as the number of times two tags areassociated with the same image, the number of times a user indicates acertain preference (like or dislike) for an image, and the tags that areassociated with the image, etc. However, the threshold for determiningthe association may vary without departing from the spirit and scope ofthe present disclosure.

Upon determining one or more additional tags that are associated withone or more tags from the set of tags that are associated with an imagethat the user indicated a positive preference for, thecomputer-implemented method or algorithm 200 a determines a next set oftags based on the next set of tags including at least one tag of the oneor more additional tags. If there are several one or more additionaltags, one, or more than one, of the one or more additional tags areselected to be in the next set of tags. The selection of which of theone or more additional tags to add to generate the next set of tags canvary. The selection can be random, such that, for example, one or moretags from a total of four additional tags are selected to be included inthe next set of tags. Alternatively, the selection can be based on aweighting of the tags. The weighting of the tags is further describedbelow with respect to FIGS. 2B and 2C.

As discussed above, the tags can be categorized generally as primarytags and secondary tags. An image can be associated with both primarytags and secondary tags. According to some embodiments, only tags withinthe plurality of tags that are primary tags are processed to determineadditional primary tag(s) to add to the previous set of tags.Alternatively, all tags within the plurality of tags (e.g., primary andsecondary) are processed to determine the additional tags to be added tothe previous set of tags. Whether only primary tags or both primary tagsand secondary tags are processed to determine additional tags to add tothe set of tags associated with the previous image can be determinedbased on the number of images within a sequence that already have beenpresented to a user. For example, if the image is one of the first Nimages presented to the user, where N is 2, 3, 4, or 5, only the primarytags within the plurality of tags are processed to determine anadditional tag to add to the previous set of tags. However, if the imageis a later image presented to the user, such as the sixth, seventh, oreighth image within a session, both primary tags and secondary tags areprocessed to determine additional tags to add to the previous set oftags.

As discussed above, the preference that a user can indicate in responseto being presented an image representing an object can be a positivepreference or a negative preference. Additionally, the preference can bea neutral preference. In response to the preference indicated for animage being a neutral preference, the set of tags (e.g., combination oftags) that are associated with the image are stored and no set of tags(e.g., combination of tags) that include only that set of tags issubsequently presented to the user for the remainder of the session. Insome aspects, the computer-implemented method or algorithm 200 a createsa data table that includes sets of tags that are associated with neutralpreferences of the user. In determining a next set of tags, thecomputer-implemented method or algorithm 200 a analyzes the data tableso that the next set of tags does not include a set of tags thatreceived a neutral preference.

In some aspects, no image that is associated with each tag from a set oftags that received a neutral preference is subsequently presented to theuser for the remainder of the session. Alternatively, no image that isassociated with only the tags from a set of tags that received a neutralpreference is subsequently presented to the user for the remainder ofthe session. Accordingly, in response to a neutral preference, thecomputer-implemented method or algorithm 200 a processes the pluralityof tags and determines the next set of tags based on the next set oftags not including the one set of tags corresponding to the image,either alone or, alternatively, in any combination with additional tags,for a remainder of the session. Thus, sets of tags are logged that areassociated with a neutral preference to narrow down the possible nextsets of tags and, therefore, images that can be presented to the user.

Upon determining the set of tags based on the preference and the set oftags for the previous image, the computer-implemented method oralgorithm 200 a determines the next image to present to the user (208).The next image is an image from a plurality of images that is associatedwith the next set of tags. Multiple images can be associated with thesame set of tags. Accordingly, the computer-implemented method oralgorithm 200 a selects a single image from the images that share thesame set of tags. The criteria of the selection of the image can vary.The selection can be random, such that a random image is selected fromthe images that share the same set of tags. Alternatively, the selectionmay be based on a process or metric. As discussed above, the database108 stores information pertaining to how many times the user hasinteracted with a specific tag and/or a specific image. The process ormetric can include analyzing the number of interactions between the userand the images that share the same set of tags and selecting the imagethat has the highest number of interactions. The image with the highestnumber of interactions may correspond to a high likelihood that the userhas a current object of interest in the physical object represented bythe image. Alternatively, the process can include selecting the imagethat has the lowest number of interactions with the user. Theinteractions can include any interaction, such as any time the user waspresented the image and regardless of the preference the user providedin response to the image. Alternatively, the interactions can be limitedto only interactions where the user provided a specific preference, suchas a positive preference, a negative preference, or a neutralpreference. Alternatively, the process or metric may be based on thesource that is associated with the physical object that is representedby the image.

The computer-implemented method or algorithm 200 a generates a sequenceof images based on repeating the above process of at least presentingone image to the user and awaiting an input from the user regardingwhether the user has a positive or a negative, or a neutral, preferencefor the physical object represented by the one image (210). The sessionof the computer-implemented method or algorithm 200 a continues eachtime the user provides a preference for the currently presented image,and determines the next set of tags and the next image to present basedon the preference for the previous image and the set of tags associatedwith the previous image. The human interaction with thecomputer-implemented method or algorithm 200 a based on a repeatedpresentation (e.g., display) of one image at a time to the user, and theuser providing the preferences for the one image, narrows down thephysical object that the user is currently interested in based on thesets of tags associated with the images presented to the user thatrepresent the various possible physical objects. Thecomputer-implemented method or algorithm 200 a continues during asession as long as the user continues to provide inputs corresponding tothe user's preferences to physical objects represented by images. Thus,according to some embodiments, the computer-implemented method oralgorithm 200 a continues indefinitely or at least until the number ofimages and/or tags are exhausted during the session based on theprocessing discussed above. During the session, tags and sets of tagsare removed based on negative or neutral responses, as described above.Thus, a session can end in the event that there are no more tags and/orimages to present to a user. Alternatively, a single session ofpresenting a sequence of images can last until a predetermined number ofimages have been presented or displayed to the user, or until apredetermined number of inputs have been received from the user. Forexample, a session of presenting images can last for 10 images. If theuser has not yet determined a physical object that the user is currentlyinterested in after the 10th image, the session ends, and thecomputer-implemented method or algorithm 200 a restarts a new session.Restarting a new session of the computer-implemented method or algorithm200 a resets the removed tags, the sets of tags that were neutralized,or both from the previous session. For example, all of the plurality oftags and sets of tags that were initially available at the beginning ofthe computer-implemented method or algorithm 200 a are again availablefrom which to determine new sets of tags and new images to present tothe user. Alternatively, the session of the computer-implemented methodor algorithm 200 a ends once the user selects an image that represents aphysical object that the user is interested in, as described in moredetail below.

FIG. 2B is a flowchart of a computer-implemented method or algorithm ofdetermining weightings of tags based on tag associations using aspectsof the present disclosure including the computer 102 a, the server 106,and the database 108. The computer-implemented method or algorithm 200 bcan be a separate algorithm for purposes of implementation within thesystem 100 compared to the computer-implemented method or algorithm 200a. Alternatively, the computer-implemented method or algorithm 200 b canbe an extension or a sub-routine of the computer-implemented method oralgorithm 200 a.

As discussed above, electronic tags that are added to a previous set oftags in response to a positive preference for a previous electronicimage may be determined based on weightings and/or associations betweenthe tags. To make these determinations, the computer-implemented methodor algorithm 200 b determines associations between tags based tags thatare associated with same electronic image (212). The associations can bedetermined for all tags within the pool of tags. In such a case, theassociations apply to all users of the system 100, rather than only aspecific user. Alternatively, the associations can be determined for alltags within the plurality of tags that are specific to the user. In sucha case, the associations apply to only the specific user, and not to allusers of the system 100. The associations can be determinedcontinuously, periodically, or on-demand, such as each time a userbegins a new instance or session of an application executing on thecomputer-implemented method or algorithm 200 b.

In some aspects, the associations are based on the number of times eachpair of tags, from among the tags that are being considered, areassociated with the same image. Thus, the more times the tags, forexample, A and B appear together for the electronic images, the higherthe association between A and B. Alternatively, the associations can bebased on groups of three or more tags, and the number of times thegroups of three or more tags are associated with the same image.According to the determination of what constitutes an association, thecomputer-implemented method or algorithm 200 b determines theassociations for the tags.

After determining the associations, the computer-implemented method oralgorithm 200 b determines the weightings of the tags based on theassociations (214). In some aspects, the number of associations can bedirectly used as a weighting. For example, if the tags A and B areassociated with the same image 50 times, the weighting may be 50.Alternatively, the weighting may be determined according to a furtherprocessing of the number of associations, such as a normalizing of theassociations, taking the base 10 logarithm of the number ofassociations, etc. Once the weightings are determined, the weightingsare used to determine the additional one or more tags to the added tothe previous set of tags.

Because the previous set of tags that the user provided a preference forin relation to the corresponding image may have multiple tags, each tagmay have a different highest-weighted tag. For example, if the previousset of tags included the tags A, C, E, and G, each of the tags A, C, E,and G may have a different highest-weighted tag. For example, thehighest-weighted tags may be B, D, F, and H, respectively. In whichcase, the highest weighted-tag of all four highest-weight tags may bedetermined as the additional tag to add to the previous set of tags forgenerating the next set of tags, such as tag B. Alternatively, if morethan one tag of the previous set of tags share the same highest-weightedtag (e.g., tag A and tag C each have tag B as their highest-weightedtag), although tag B is not the highest-weighted tag among all of thehighest-weighted tags associated with the previous set of tags (e.g.,tag F may have a higher weighting), tag B may nonetheless be added asthe additional tag to the previous set of tags. In such a case, theweighting may be cumulative over multiple tag associations. For example,if the tag B has 50 associations each with tags A and C, and tag H has80 associations with tag E, tag B's cumulative weighting is 100, whichis greater than 80 for tag H. Thus, tag B is determined as theadditional tag. By adding tags based on the weighting of tags, theprocess of determining a user's current object of interest may beexpedited.

FIG. 2C is a flowchart of another computer-implemented method oralgorithm 200 c of determining weightings of tags based on tagfrequencies using aspects of the present disclosure including thecomputer 102 a, the server 106, and the database 108. Thecomputer-implemented method or algorithm 200 c can be a separatealgorithm for purposes of implementation within the system 100 comparedto the computer-implemented methods or algorithms 200 a and 200 b.Alternatively, the computer-implemented method or algorithm 200 c can bean extension or a sub-routine of the computer-implemented methods oralgorithms 200 a and 200 b.

The above-described weightings of the tags may be based on differentschemes than solely on the associations between the tags. In someaspects, the weightings can be based on the specific user and thespecific user's interactions with respect to the tags, generallyreferred to as frequencies. Thus, the computer-implemented method oralgorithm 200 c determines the frequencies associated with the tags(216).

In some aspects, the frequencies can be based on the number of times atag is presented to the user. For example, each time an image ispresented to the user (e.g., displayed on the display of the computer102 a), the frequencies of the tags that are associated with the imageare incremented (e.g., incremented by one). In some aspects, thefrequencies can be based on both the number of times a tag (e.g., basedon the associated image) is presented to a user and the preference theuser provided associated for the image. The frequencies can beconsidered based on only positive preferences, only negativepreferences, or both. If a user is frequently presented images that areassociated with a specific tag, and the user frequently provides apositive preference for the images, the tag is associated with a highfrequency. Conversely, if a user is frequently presented images that areassociated with a specific tag, and the user frequently provides anegative preference for the images, the tag is associated with a lowfrequency. Alternatively, the tag can be associated with no frequency ifonly positive preferences result in frequencies being incremented and/orlogged. Thus, the computer-implemented method or algorithm 200 c tracksthe number of times a user interacts with a specific tag, and optionallyalso the corresponding preference for the presented image that isassociated with the tag, and uses this information to generate afrequency for the tag.

After determining the frequencies, the computer-implemented method oralgorithm 200 c determines the weightings of the tags based on thefrequencies (218). In some aspects, the greater the number of times atag is presented to the user, the higher the weighting of the tag.Alternatively, in some aspects, the greater the number of times a tag ispresented to a user, the lower the weighting of the tag. In someaspects, the frequencies for the tags can be directly used as aweighting. For example, if tag A is presented to the user 50 times, theweighting for tag A can be 50. If each time the tag is presented to auser and the user provides a positive preference for the tag, theweighting may be a multiple of the number of times the tag is presented,where the multiplication factor provides additional weighting for thepositive preference. Alternatively, the weighting can be determinedaccording to a further processing of the frequencies, such as anormalizing of the frequencies, taking the base 10 logarithm of thefrequencies, etc. Once the weightings are determined, the weightings canbe used to determine the additional one or more tags to the added to theprevious set of tags.

In some aspects, the weightings of the tags are determined based oneither the associations described with respect to FIG. 2B or thefrequencies described with respect to FIG. 2C. In other aspects, theweightings of the tags are determined based on both of the associationsin FIG. 2B and the frequencies in FIG. 2C. The combined weightings canbe a straight combination such that each weighting scheme is given thesame weight. Alternatively, one weighting scheme can be provided adifferent weight with respect to the other weighting scheme. Forexample, the frequencies of the tags being presented to the user, orparticularly the frequency of the number of times a positive preferenceis associated with a tag, can be given a higher weighting than thenumber of associations between tags. By way of example, one tag (e.g.,tag Y) may be associated with a tag in the previous set of tags 100times through both tags being tagged in 100 images. At the same time,one tag (e.g., tag Z) may have been presented to the user 50 times inthe past, and have been associated with 50 positive preferences providedby the user. Tag Z may be given a greater weight than tag Y because theweighting of tag Z applies directly to the user, whereas the weightingof tag Y applies to all users. Thus, the next set of tags, and thecorresponding image that is presented to the user, is based on theprevious set of tags and the addition of tag Z based on the weighting.

FIG. 2D is a flowchart of a computer-implemented method or algorithm 200d for queuing one or more electronic images at the computer 102 a topresent to a user within the system 100, using aspects of the presentdisclosure including the computer 102 a, the server 106, and thedatabase 108. The computer-implemented method or algorithm 200 d can bea separate algorithm for purposes of implementation within the system100 than the computer-implemented methods or algorithms 200 a-200 c.Alternatively, the computer-implemented method or algorithm 200 d can bean extension or a sub-routine of the computer-implemented methods oralgorithms 200 a-200 c.

To save network and computer resources, in addition to reducing thelatency between images being presented, one or more electronic imagescan be electronically transmitted or downloaded to the computer 102 a tocreate a queue of the next electronic image to present to the user.However, because the next electronic image that is presented to the useris determined based, at least in part, on the user's preference of thecurrently presented electronic image, the exact image that will bepresented (e.g., displayed) cannot be determined until the user inputshis or her preference regarding the displayed image. Accordingly, thecomputer-implemented method or algorithm 200 d determines a next sets oftags in response to each possible indication of a preference associatedwith the currently presented image (220). If the possible preferenceindications are positive and negative, the computer-implemented methodor algorithm 200 d determines two next sets of tags. One of the nextsets of tags corresponds to the user indicating a positive preferencefor the currently presented electronic image. The other of the next setsof tags corresponds to the user indicating a negative preference for thecurrently presented electronic. The two next sets of tags are determinedas described above, and as further described below with respect to FIG.3 . However, the next sets of tags are determined prior to the userproviding an indication of a preference, rather than in response to theuser providing the indication, as a step in generating a queue ofelectronic images.

The computer-implemented method or algorithm 200 d determines each nextimage associated with each next set of tags (222). Thecomputer-implemented method or algorithm 200 d determines the nextimages before the user provides the preference indication. The nextimages associated with each next set of tags are determined as describedherein.

Once the computer-implemented method or algorithm 200 d determines thenext image associated with each of the next set of tags, the nextimages, and only the next images among the pool of images, aretransferred to the computer 102 a (224). The images are queued prior tothe user providing the preference for the currently presented image.Accordingly, once the user provides the preference, the next image isalready available and stored on the user's computer 102 a and ready tobe presented or displayed on a display of the user's computer 102 a.Therefore, the computer-implemented method or algorithm 200 d providesthe next image without imposing any latency to transfer the nextelectronic image to the computer 102 a in response to receiving theuser's preference. Yet, the computer-implemented method or algorithm 200d only transmits to the computer 102 a one electronic image for eachpossible preference. Therefore, although the user enjoys the benefit ofhaving the next electronic image already stored on the computer 102 a,so as to avoid the delay in downloading the next image, the computer 102a does not need to store a large number of electronic images. Nor doesthe system 100 require a large amount of data to be transmitted betweenthe computer 102 a and the server 106. Instead, the data is transmittedas needed and on demand to reduce network resources, as well as computer102 a and server 106 resources.

The computer-implemented method or algorithm 200 d is contrasted withrespect to conventional image search algorithms and platforms. Inconventional image search algorithms and platforms, the algorithms andplatforms are unable to determine the user's next action, because theuser has to define the next action rather than select an action from alimited selection of actions. For example, a user using a conventionalsearch platform must enter the search terms that define what the user issearching for. If the initial search does not return what the user issearching for, the user must manually define and update the search termsin hopes of receiving better search results. Because the user is left tomanually define and update the search terms that generate the nextsearch results, the conventional search platform cannot provide allpossible search results prior to the user providing the updates to thesearch terms. However, because of the iterative approach of thecomputer-implemented method or algorithm 200 d, and the user respondingbased on a set number of possible preferences, the computer-implementedmethod or algorithm 200 d is able to queue up the images in response tothe possible preferences. This provides for a more responsive andtailored user experience contrasted with conventional search platforms,while still minimizing the resources required at the computer 102 a, theserver 106, and the network therebetween. Accordingly, thecomputer-implemented method or algorithm 200 d improves the functioningof the computer 102 a, the server 106, and the network therebetween atleast compared to conventional search platforms, and the computerdevices and networks upon which the conventional search platforms run.

FIG. 2E is a flowchart of a computer-implemented method or algorithm 200e of determining, from among the entire pool of tags and the entire poolimages, the plurality of tags and the plurality of images that arerelevant for the user for a particular session and that are processedand analyzed for determining images to present to the user, usingaspects of the present disclosure including the computer 102 a, theserver 106, and the database 108. The computer-implemented method oralgorithm 200 e can be a separate algorithm for purposes ofimplementation within the system 100 than the computer-implementedmethods or algorithms 200 a-200 d. Alternatively, thecomputer-implemented method or algorithm 200 e can be an extension orsub-routine of the computer-implemented methods or algorithms 200 a-200d.

The computer-implemented method or algorithm 200 e selects the pluralityof tags that are processed for determining the next set of tags,discussed above in the computer-implemented method or algorithm 200 a,and from which an initial image is presented, from among the pool oftags within the database 108 (226). The plurality of tags is selectedbased on the plurality of tags matching one or more tags associated witha profile of the user. Thus, tags that are relevant to a user, accordingto the tags matching tags that are within the user's profile, areselected to be within the plurality of tags that are processed asdiscussed above in the computer-implemented method or algorithm 200 a.The tags that are selected are tags that have an exact match with tagswithin a user's profile. Alternatively, the tags that are selected aretags that have an exact match or that satisfy a threshold associationwith tags within the user's profile. The association can be based on anyassociation described herein, such as the tags typically beingassociated with the same image based on trends of images and tags withinthe database 108. The tags that are selected from among the pool of tagscan be only primary tags, or the tags can be both primary tags andsecondary tags. In some examples, primary and secondary tags have anequal weight, but in other examples, a primary tag can have a higherweight compared to a secondary tag.

The computer-implemented method or algorithm 200 e also determines alocation associated with the user, the computer 102 a that is executingthe application to perform the computer-implemented method or algorithm200 e, or a combination thereof (228). The location associated with thecomputer 102 a can be determined automatically based on variousfunctionality of the computer 102 a, such as a GPS (global positioningsystem) receiver within the computer 102 a. Alternatively, the locationassociated with the user and the computer 102 a can be determined basedon the user manually entering a location within the computer 102 a. Thelocation manually entered by the user can be a current location or adifferent location, such as a location that a user plans on being atduring a certain time.

Based on the plurality of tags that are selected from the pool of tags,and the location of the user and/or the computer 102 a, thecomputer-implemented method or algorithm 200 e selects images from amongthe pool of images (230). The images are selected based on the imagesbeing associated with at least one tag of the plurality of tags that areselected from the pool of tags. Further, the images are selected basedon each image being associated with the location of the user and/or thecomputer 102 a. Based on the computer-implemented method or algorithm200 e, the processing of the tags and the selection of the images withinthe computer-implemented method or algorithm 200 a is limited to thetags that are relevant to the user and to the images that representphysical objects that are local to a specific location (e.g., currentgeographic location of user and/or computer 102 a, or planned/expectedlocation of the user and/or computer 102 a).

The first image presented during a session of the computer-implementedmethod or algorithm 200 a is an image within the pool of images. By wayof example, the first image is randomly selected from among theplurality of images as a first image of the sequence of images.Alternatively, the first image can be an image from among the pluralityof images that is associated with a high number of interactions with theuser, either through direct interactions between the user and the image,such as the user indicating a preference in response to being presentedan image, or through interactions between one or more tags associatedwith the image and the user. Alternatively, the first image presented tothe user within a session of the computer-implemented method oralgorithm 200 a can be based on a search by the user for a specific tag,physical object, or source that provides the physical object. Forexample, the user can elect to begin a session of thecomputer-implemented method or algorithm 200 a and enter the name of thephysical object they seek. In response, the computer-implemented methodor algorithm 200 a searches for images within the database 108containing one or more tags describing the physical object, enabling theuser to search his or her geographic area for sources of that physicalobject.

FIG. 2F is a flowchart of a computer-implemented method or algorithm 200f of determining and/or updating associations between elements withinthe system 100, using aspects of the present disclosure including thecomputer 102 a, the server 106, and the database 108. Thecomputer-implemented method or algorithm 200 f can be a separatealgorithm for purposes of implementation within the system 100 than thecomputer-implemented methods or algorithms 200 a-200 e. Alternatively,the computer-implemented method or algorithm 200 f can be an extensionor a sub-routine of the computer-implemented methods or algorithms 200a-200 e.

During a session of generating a sequence of images by thecomputer-implemented method or algorithm 200 a, the computer-implementedmethod or algorithm 200 f logs the inputs from the user as interactions(232). The inputs are logged as interactions with the tags, the sets oftags, the images, the physical objects, and/or the entities associatedwith the physical objects for which the inputs apply. When a userprovides an input of a preference associated with an image, the input islogged as applying to the image, the physical object represented by theimage, one or more tags associated with the image, and/or the sourceassociated with the physical object. The input can be logged relative toonly the user, or the input can be logged across all users.

The logging of the inputs allows the computer-implemented method oralgorithm 200 f to modify associations between the various informationalelements within the system 100 (234). For example, the logging allowsthe computer-implemented method or algorithm 200 f to modifyassociations between tags, between sets of tags, and/or between an imageand a tag and/or a set of tags based on the interactions. Theassociations can be modified relative to the user making the inputs, orthe associations can be applied to all users. Accordingly, theassociations discussed and used with the computer-implemented methods oralgorithms discussed above are dynamic and constantly evolving based onthe continued user inputs.

FIG. 3 is a diagram of a flow 300 illustrating the processing of aplurality of tags that are relevant to a user over the course of asession of the computer-implemented method or algorithm 200 a. The flowbegins with a set of tags 302. The set of tags 302 is associated with animage that is presented to the user at the computer 102 a throughexecution of the application 114 a. Specifically, the display device 112a displays the image that is associated with the set of tags 302. Asshown, the set of tags 302 includes primary tags 302 a and secondarytags 302 b. The tags can be any of the above-described tags; however,for purposes of convenience, the tags are represented by alphabeticalcharacters. Thus, the primary tags 302 a of the set of tags 302 includethe tags A, B, and C, and the secondary tags 302 b of the set of tags302 include the tags D and E.

In response to the presentation of the image associated with the set oftags 302, the user indicates, for example, a preference for the physicalobject represented by the image. As described above, the preference maybe indicated through the user interface device 110 a. For purposes ofexplanation, the preference is represented by the arrow 314 a in FIG. 3. Specifically, the arrow 314 a represents a preference for the imageassociated with the set of tags 302 that is negative.

Based on the negative preference, the computer-implemented method oralgorithm 200 a processes the plurality of tags to determine a next setof tags and a next image that is associated with the next set of tags.The set of tags 304 represents the next set of tags determined by thecomputer-implemented method or algorithm 200 a, and an image that isassociated with the set of tags 304. The set of tags 304 includes theprimary tags 304 a F, G, and H, and the secondary tags 304 b I and J.Because the user provided a negative preference in response to thephysical object represented by the image that was associated with theset of tags 302, the set of tags 304 does not include any of the primarytags 302 a. Specifically, the primary tags 302 a of A, B, and C areremoved from the plurality of tags that are processed to determine thenext set of tags for the remainder of the session of thecomputer-implemented method or algorithm 200 a.

Similar to above, in response to the presentation of the imageassociated with the set of tags 304, the user indicates a preference forthe physical object represented by the image. For purposes ofexplanation, the preference is represented by the arrow 316 a in FIG. 3. Specifically, the arrow 316 a represents a preference for the imageassociated with the set of tags 304 that is positive.

Based on the positive preference, the computer-implemented method oralgorithm 200 a processes the plurality of tags to determine a next setof tags and a next image that is associated with the next set of tags.The set of tags 306 represents the next set of tags determined by thecomputer-implemented method or algorithm 200 a, and an image that isassociated with the set of tags 306. Because the user indicated apositive preference to the previous physical object represented by theimage associated with the set of tags 304, the set of tags 306 includesthe primary tags 306 a F, G, H, and K, which are the primary tags 304 aand the additional primary tag K. That is, the computer-implementedmethod or algorithm 200 a builds upon the set of tags 304 based on thepositive preference of the user by determining a set of tags thatincludes the previous primary tags and an additional primary tag (ormore), and the corresponding image that the set of tags is associatedwith.

The set of tags 306 also includes the secondary tags 306 b D, E, and I.Despite the user indicating a negative preference for the set of tags302, which included the secondary tag D, the secondary tag D can be usedagain in a subsequent set of tags because the tag is a secondary tag.Alternatively, the secondary tags may also be removed from the pluralityof tags that are processed, for the remainder of the session, todetermine a next set of tags, instead of only the primary tags.

In response to the presentation of the image associated with the set oftags 306, the user indicates a preference for the physical objectrepresented by the image. For ease of explanation, the preference isrepresented by the arrow 314 b in FIG. 3 . Specifically, the arrow 314 brepresents a preference for the image associated with the set of tags306 that is negative.

Based on the negative preference, the computer-implemented method oralgorithm 200 a processes the plurality of tags to determine a next setof tags and a next image that is associated with the next set of tags.The set of tags 308 represents the next set of tags determined by thecomputer-implemented method or algorithm 200 a, and an image that isassociated with the set of tags 308. The set of tags 308 includes theprimary tags 308 a F, G, H, and L, and the secondary tags 304 b M, N,and O. Because the user provided a negative preference in response tothe physical object represented by the image that was associated withthe set of tags 306, the set of tags 308 does not include the primarytag that was added between the set of tags 304 (e.g., last positivepreference) and the set of tags 306, i.e., primary tag K. That is, thenegative preference in response to the set of tags 306 is attributed tothe addition of the primary tag K; thus, the primary tag K is removedfrom the plurality of tags for the remainder of the session such that nosubsequent set of tags can include the primary tag K. The set of tags308 also includes the secondary tags 308 b M, N, and O.

In response to the presentation of the image associated with the set oftags 308, the user indicates a preference for the physical objectrepresented by the image. For purposes of explanation, the preference isrepresented by the arrow 318 a in FIG. 3 . Specifically, the arrow 318 arepresents a preference for the image associated with the set of tags308 that is neutral.

Based on the neutral preference, the computer-implemented method oralgorithm 200 a processes the plurality of tags to determine a next setof tags and a next image that is associated with the next set of tags.The set of tags 310 represents the next set of tags determined by thecomputer-implemented method or algorithm 200 a, and an image that isassociated with the next set of tags 310. The set of tags 310 includesthe primary tags 310 a F, G, H, and P, and the secondary tags 310 b D,E, and O. Because the user provided a neutral preference in response tothe physical object represented by the image that was associated withthe set of tags 308, the set of tags 310 does not include the primarytag that was added between the set of tags 306 (e.g., last positivepreference) and the set of tags 308, i.e., primary tag L. That is, theneutral preference in response to the set of tags 308 is attributed tothe entire set of primary tags 308 a, including the primary tag K andthe primary tags F, G, and H. Thus, the set of primary tags 308 a isremoved from the plurality of tags that are processed, in the sense thatthe exact same set of primary tags 308 a can never be presented to theuser again. However, the primary tag L is not removed from the pluralityof tags for the remainder of the session such that subsequent sets oftags can include the primary tag L, as long as the set of tags is notthe exact set of primary tag 308 a. The set of tags 310 also includesthe secondary tags 310 b D, E, and O.

In response to the presentation of the image associated with the set oftags 310, the user indicates a preference for the physical objectrepresented by the image. For purposes of explanation, the preference isrepresented by the arrow 316 b in FIG. 3 . Specifically, the arrow 316 brepresents a preference for the image associated with the set of tags310 that is positive.

Based on the positive preference, the computer-implemented method oralgorithm 200 a processes the plurality of tags to determine a next setof tags and a next image that is associated with the next set of tags.The set of tags 312 represents the next set of tags determined by thecomputer-implemented method or algorithm 200 a, and an image that isassociated with the set of tags 312. Because the user indicated apositive preference to the previous physical object represented by theimage associated with the set of tags 310, the set of tags 312 includesthe primary tags 310 a F, G, H, P, Q, and R, which are the primary tags310 a and the additional primary tags Q and R. That is, as describedabove, the computer-implemented method or algorithm 200 a builds uponthe positive preference of the user by determining a set of tags thatincludes the previous primary tags and one or more additional primarytags, and the corresponding image that the set of tags is associatedwith.

The flow 300 continues until the user selects a physical object that isrepresented by a currently presented image, which corresponds to thelast image that is presented within the above sequence of images, as aphysical object that the user would like to obtain. Alternatively, theflow 300 continues until the session is ended and restarted, for thereasons discussed above. In each case, when a session of thecomputer-implemented method or algorithm 200 a is started or restarted,the plurality of tags and images that are processed are reset such thatthe tags and sets of tags that were removed from the plurality of tagsare inserted back into the plurality of tags for processing.

The following figures use any of the aspects described above inconnection with the foregoing FIGS. 1-3 . These figures and accompanyingdescription lay out some of the foundational aspects of the presentdisclosure, which the following figures show as mere exemplars of themany implementations contemplated by the present disclosure.

FIGS. 4A-4G illustrate user interfaces (UIs) 400 a-400 g, respectively,that are presented on a computer 102 a as part of an application 114 aexecuted on the computer 102 a for analyzing tags associated with asequence of images presented to a user to guide a user to a currentobject of interest. Referring to FIG. 4A, when starting a session of thecomputer-implemented method or algorithm, images appear one at a timeand users interact with the images to populate a dynamic sequence ofimages. According to the various configurations of the system 100, theimages are pushed by the server 106, from the database 108, to theapplication 114 a on the computer 102 a one at a time, and in responseto, for example, indications of preferences by a user. However, asdiscussed above, in some aspects, the images can be pushed by the server106 in numbers that correspond to the number of selectable preferences auser can provide in response an image. For example, in response to auser being able to select a positive preference or a negativepreference, two images are pushed to the computer 102 a, prior to theuser providing the preference. In response to a user being able toselect a positive preference, a negative preference, or a neutralpreference, three images are pushed to the computer 102 a, prior to theuser providing the preference. Alternatively, the images may beretrieved from the database 108 by the application 114 a, eitherdirectly or through the server 106. Alternatively, the images may becontained within the application 114 a on the computer 102 a.

FIG. 4A illustrates the main UI 400 a of the computer-implemented methodor algorithm 200 a. As shown, the UI 400 a includes an image 402 a(e.g., image A). The image 402 a represents a physical object (e.g.,physical object A). Below the image 402 a are user interface elements404 a and 404 b. Specifically, the user interface elements 404 a and 404b allow a user to enter inputs associated with the image 402 a, and thecorresponding physical object represented by the image, for the user toprovide a preference for the physical object represented by the image402 a. For example, the user interface element 404 a is an icon of an X,which corresponds to a negative preference, and the user interfaceelement 404 b is an icon of a checkmark, which corresponds to a positivepreference. The UI 400 a also includes a main toolbar 406 that allowsthe user to navigate within the application 114 a. Within the maintoolbar 406 are icons corresponding to functions of the application 114a, including a Home icon 406 a, a Source icon 406 b, a Search icon 406c, and a My Profile icon 406 b. The Search icon 406 a initiates asession of the computer-implemented method or algorithm 200 a thatbegins the method or algorithm for analyzing tags associated with asequence of images presented to a user to present a current object ofinterest of the user. Thus, prior to the UI 400 a being presented in thedisplay device 112 a of the computer 102 a, the user, for example,selected the Search icon 406 a.

FIG. 4B shows a subsequent user interface after the UI 400 a.Specifically, upon the user selecting one of the user interface elements404 a or 404 b, the UI 400 a transitions to UI 400 b. UI 400 b includesa new image 402 b (e.g., image B). Like image 402 a, the image 402 brepresents a physical object (e.g., physical object B). By way ofexample, the user may have selected the user element 404 a to indicatethat the user has a negative preference (e.g., dislike) for the physicalobject represented by the image 402 a. In response, thecomputer-implemented method or algorithm 200 a determined a next set oftags that does not include tags from the previous set of tags associatedwith the image 402 a, and determined an image (e.g., image 402 b) thatis associated with the next set of tags to present to the user.Accordingly, the image 402 b does not have the same primary tags as theprimary tags associated with the image 402 a.

FIG. 4C shows a subsequent user interface after the UI 400 b. The UI 400c of FIG. 4C may be after several rounds of the computer-implementedmethod or algorithm 200 a selecting next sets of tags and imagesassociated with the next sets of tags, and receiving inputs from theuser indicating preferences for the physical objects represented by theimages. By way of explanation, the UI 400 c may be presented after an Nnumber of images were previously presented. Thus, the UI 400 c includesa new image 402 c (e.g., image C). Like images 402 a and 402 b, theimage 402 c represents a physical object (e.g., physical object C).

FIG. 4D shows a detailed view UI 400 d associated with the image 402 cin FIG. 4C. By way of example, the UI 400 c transitions to the UI 400 dby the user selecting the image 402 c in the UI 400 c. The UI 400 dincludes the same image 402 c in FIG. 4C. In addition, the UI 400 dincludes user interface elements 408 a and 410 a. User interface element408 a corresponds to a title or caption associated with the image 402 c.The title or caption of the user interface element 408 a is a textstring that describes the physical object that is represented by theimage 402 c. User interface element 410 a lists the tags that areassociated with the image 402 c. The user interface element 410 a allowsa user to directly see the tags that are associated with the image 402 cand, therefore, also associated with the physical object that isrepresented by the image 402 c.

FIG. 4E shows a UI 400 e that includes a recommendation for a sourcebased on the currently presented image 402 d, which is presented basedon the computer-implemented method or algorithm 200 a. For example, theuser may have indicated a negative preference or dislike in response tobeing presented the image 402 c. Based on reverting back to the tagsthat were last associated with a positive response (for example, 402 b),the computer-implemented method or algorithm 200 a may have determinedthe image 402 d as the next image to present to the user. Similar to theUI 400 d, the UI 400 e includes a detailed view associated with thecurrently presented image 402 d. As shown, the image 402 d shows adigital photograph of Image D the user interface element 408 b shows thecaption Image D. The UI 400 e further includes the user interfaceelement 410 b, which provides the tags that are associated with theimage 402 d. Further, the UI 400 e includes the user interface element412. The user interface element 412 provides an indication of a numbersources within the area, for example, defined by the location of theuser, the computer 102 a, or both, that provide the physical object(e.g., physical object D) that is associated with the image 402 a. Asshown, there are 15 sources within a threshold location of the user thatprovide the physical object D that is associated with the image 402 d.

The user interface element 412 may be presented to the user within theUI 400 e in response to the user providing an indication that the useris interested in obtaining the physical object associated with the image402 d. Such an indication can be provided according to various methods,such as the user double tapping or selecting the image 402 d. Inresponse, the application 114 a presents the user interface element 412within the UI 400 e. Thus, once a user is guided to a physical objectthat the user is interested in, the computer-implemented method oralgorithm 200 a provides information on sources that provide thephysical object. In this case, the entities are the 15 sources. Inresponse to the user selecting the user interface element 412, theapplication 114 a causes a transition from the UI 400 e to the UI 400 f.

FIG. 4F shows the UI 400 f, which includes a list of sources (e.g.,Sources 1-7) that offer the physical object for which the user requestedadditional information. The UI 400 f includes a list of sources 414a-414 g, that provide the physical object associated with the image 402d. From the UI 400 f, the user is able to choose a specific source fromthe list of sources 414 a-414 g. Upon selecting a source, such as thefirst source associated with the first user interface element 414 a, theapplication 114 a causes a transition from the UI 400 f to the UI 400 g.

FIG. 4G shows a UI 400 g that provides information regarding a specificsource that offers the physical object associated with the image 402 d.Below the image 416, the UI 400 g includes the name of the source (e.g.,Source 1). The UI 400 g also includes a user interface element 418. Theuser interface element 418 can be associated with a hyperlink to foradditional information on the source. Alternatively, the user interfaceelement 418 may direct the user to a landing site within the applicationfor the source. The landing site for the source may provide additionalinformation regarding the source, such as the information that iscontained with the profile stored within the database 108. FIG. 4H showsa UI 400 h for a user to upload and associate an image of a physicalobject into the system 100, such as stored within the database 108 ofthe system 100. The UI 400 h includes an area 420 to display the imagethat will be associated with the physical object. The image can beobtained according to various methods, such as a camera integratedwithin the computer 102 a, such as in the case of a smartphone, or bylinking to an image on the Internet or saved in a memory device of thecomputer 102 a. Similar to the UI 400 f, the UI 400 h also includes auser interface element 422 that allows a user to insert a title or acaption for the image. The UI 400 h also includes a user interfaceelement 424 to associate the image within the area 420 with one or moretags that describe the physical object represented by the image. The UI400 h also includes a user interface element 426 to associate a locationwith the image and the physical object. The location can either bedetermined automatically, such as through components and/or moduleswithin the computer 102 a (e.g., Global Positioning System receivers),or can be manually entered by the user.

FIG. 4I illustrates the UI 400 i as the user enters information withinthe user interface elements 422 and 422. To select the tags and enterthe caption, the UI 400 i includes a graphical representation of anelectronic keyboard 428. However, the user can enter the text accordingto various other user interface devices. Once the user has completedentering the information, the image is uploaded to the database 108.FIG. 4J shows the UI 400 j that includes the user interface element 430,which indicates a successful upload of the image and the associatedinformation, such as the tags, the caption, and the location.

FIGS. 4K and 4L show user interfaces associated with a user viewingaspects of the user's profile. Specifically, FIG. 4K shows UI 400 kassociated with a user profile, including the tags that the user isassociated with based on the user interface element 432. As shown, theuser profile indicates that the user is associated with the tags Tag A,Tag B, Tag C, Tag D, Tag E, Tag F, Tag M, Tag P, as well as 60 othertags (e.g., 60 more). The tags are associated with the user by the usermanually selecting certain tags from all of the tags that are stored inthe database 108 that the user has a positive preference for (e.g.,likes). Alternatively, the tags are associated with the user implicitlyby the user's interaction with the tags over time, such as the userhaving the habit of selecting images and/or physical objects that theuser prefers that are associated with the listed tags in the userinterface element 426. The UI 400 i also includes images (e.g., digitalphotographs) that the user has provided a positive preference for (e.g.,liked) during interaction with the application 114 a.

FIG. 4L includes the UI 400 l that shows at least some additionalaspects of the user's profile. For example, the UI 400 l includes userinterface elements 436 and 438. The user interface element 436 includessocial media information regarding the user, such as an icon of theuser, the user's location (e.g., city and state), and how many users theuser is following and are following the user. The user interface element438 includes images that the user has uploaded into the system 100, suchas through the flow illustrated in FIGS. 4H-4J. The UI 400 l can includeother information within the system 100, not just the informationspecifically referenced herein with respect to FIGS. 4A-4L. For example,the UI 400 l can include a feature for users called The Top 100, whichhighlights the top rated images and/or physical objects associated withthe images at any given moment. The Top 100 images can be out of all ofthe images stored within the database 108, all of the images within thedatabase 108 that are relevant to the user based on the images beingassociated with tags that the user has liked, or all of the images ofphysical objects that are provided within a pre-defined area surroundingthe user's current location. The images representing the physicalobjects with the most positive preferences will be featured on The Top100, which provides users the incentive to upload physical objects thatare their favorite physical objects. The Top 100 list allows users togain attention. In the social media realm, the applications 114 a, 114 ballow users to attract more followers as well as support, for example,their favorite sources of physical objects. The Top 100 lists will alsobe active, allowing users to select an image within The Top 100 list tobe taken to a page associated with a profile of the source that providesthe physical object represented by the image.

The physical objects as described herein can be any physical, tangibleobjects that the user may currently have a desire for, while not beingable to describe or put into words the current desire, such as the userhaving latent desire. For example, a user may know that he or she wantssomething, but cannot determine what he or she wants. Moreover, thephysical object can represent an object that the user does not currentlyhave or an experience that the user would like to experience, but thatthe user can obtain through, at, or using one or more sources. Further,the sources as described herein can be any physical, tangible sourcethat provides the physical objects or experiences depicted in theimages. For example, the physical, tangible source can be a dealer orpurveyor of the physical objects.

While this disclosure is susceptible to various modifications andalternative forms, specific embodiments or implementations have beenshown by way of example in the drawings and will be described in detailherein. It should be understood, however, that the disclosure is notintended to be limited to the particular forms disclosed. Rather, thedisclosure is to cover all modifications, equivalents, and alternativesfalling within the spirit and scope of the invention(s) as defined bythe appended claims.

Each of these embodiments, and obvious variations thereof, iscontemplated as falling within the spirit and scope of the claimedinvention(s), which are set forth in the following claims. Moreover, thepresent concepts expressly include any and all combinations andsub-combinations of the preceding elements and aspects.

What is claimed is:
 1. A computer-implemented method comprising: transmitting, from one or more computer devices, one or more first electronic images, from among a plurality of electronic images stored on the one or more computer devices, to an electronic device associated with a user, each electronic image of the one or more first electronic images representing one or more first possible interests of the user and being associated with a corresponding set of tags from a pool of tags, each tag of the pool of tags representing an attribute of the one or more first possible interests of the user; receiving, by the one or more computer devices, an input from the user indicating one or more preferences for the one or more first possible interests represented by the one or more first electronic images; processing, by the one or more computer devices, at least a subset of the pool of tags based on the one or more preferences and the corresponding set(s) of tags for the one or more first electronic images to generate one or more next set of tags; determining, by the one or more computer devices, one or more next electronic images from the plurality of electronic images associated with the one or more next set of tags, the one or more next images representing one or more next possible interests of the user, different from the one or more first possible interests, and the one or more next set of tags describing or characterizing attributes of the one or more next possible interests represented by the one or more next electronic images; and generating a sequence by repeating the transmitting, the receiving, the processing, and the determining with the one or more next electronic images in place of the one or more first electronic images during a session of determining a current interest of the user. 